A Binary Cuckoo Search Algorithm for Graph Coloring Problem

The Graph Coloring Problem (GCP) is one of the most interesting, studied, and difficult combinatorial optimization problems. That is why several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics, and hybrid approaches. This paper tries to solve the graph coloring problem using a discrete binary version of cuckoo search algorithm. To show the feasibility and the effectiveness of the algorithm, it has used the standard DIMACS benchmark, and the obtained results are very encouraging. A Binary Cuckoo Search Algorithm for Graph Coloring Problem